Smarandache Directionally n - Signed Graphs — A Survey
نویسنده
چکیده
Let G = (V,E) be a graph. By directional labeling (or d-labeling) of an edge x = uv of G by an ordered n-tuple (a1, a2, · · · , an), we mean a labeling of the edge x such that we consider the label on uv as (a1, a2, · · · , an) in the direction from u to v, and the label on x as (an, an−1, · · · , a1) in the direction from v to u. In this survey, we study graphs, called (n, d)-sigraphs, in which every edge is d-labeled by an n-tuple (a1, a2, · · · , an), where ak ∈ {+,−}, for 1 ≤ k ≤ n. Several variations and characterizations of directionally n-signed graphs have been proposed and studied. These include the various notions of balance and others.
منابع مشابه
Directionally 2-signed and Bidirected Graphs
An edge uv in a graph Γ is directionally 2-signed (or, (2, d)signed) by an ordered pair (a, b), a, b ∈ {+, −}, if the label l(uv) = (a, b) from u to v, and l(vu) = (b, a) from v to u. Directionally 2-signed graphs are equivalent to bidirected graphs, where each end of an edge has a sign. A bidirected graph implies a signed graph, where each edge has a sign. We extend a theorem of Sriraj and Sam...
متن کاملSingle Valued Neutrosophic Signedgraphs
Motivated by the notion of single valued neutrosophic graphs defined by Broumi, Talea, Bakali and Smarandache[2] and notion of intuitionistic fuzzy signed graphs defined by Mishra and Pal[8], we introduce the concept of single valued neutrosophic signed graphs and examine the properties of this new concept and examples.
متن کاملMore Equienergetic Signed Graphs
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کامل